Elastic Partial Matching of Time Series
نویسندگان
چکیده
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b′ of a target time series b that best matches a query series a. In the proposed algorithm we map the problem of the best matching subsequence to the problem of a cheapest path in a DAG (directed acyclic graph). Our experimental results demonstrate that the proposed algorithm outperforms the commonly used Dynamic Time Warping in retrieval accuracy.
منابع مشابه
New explicit and Soliton Wave Solutions of Some Nonlinear Partial Differential Equations with Infinite Series Method
To start with, having employed transformation wave, some nonlinear partial differential equations have been converted into an ODE. Then, using the infinite series method for equations with similar linear part, the researchers have earned the exact soliton solutions of the selected equations. It is required to state that the infinite series method is a well-organized method for obtaining exact s...
متن کاملAnalytical D’Alembert Series Solution for Multi-Layered One-Dimensional Elastic Wave Propagation with the Use of General Dirichlet Series
A general initial-boundary value problem of one-dimensional transient wave propagation in a multi-layered elastic medium due to arbitrary boundary or interface excitations (either prescribed tractions or displacements) is considered. Laplace transformation technique is utilised and the Laplace transform inversion is facilitated via an unconventional method, where the expansion of complex-valued...
متن کاملThermo-elastic analysis of a functionally graded thick sphere by differential quadrature method
Thermo-elastic analysis of a functionally graded hollow sphere is carried out and numerical solutions of displacement, stress and thermal fields are obtained using the Polynomial differential quadrature (PDQ) method. Material properties are assumed to be graded in the radial direction according to a power law function, ho...
متن کاملTime Warp Edit Distance
This technical report details a family of time warp distances on the set of discrete time series. This family is constructed as an editing distance whose elementary operations apply on linear segments. A specific parameter allows controlling the stiffness of the elastic matching. It is well suited for the processing of event data for which each data sample is associated with a timestamp, not ne...
متن کاملTime Warp Edit Distance with Stiffness Adjustment for Time Series Matching
In a way similar to the string-to-string correction problem we address time series similarity in light of a time-series-to-time-series-correction problem for which the similarity between two time series is measured as the minimum cost sequence of "edit operations" needed to transform one time series into another. To define the " edit operations " we use the paradigm of a graphical editing proce...
متن کامل